A Connection between Cantor-Bendixson Derivatives and the Well-Founded Semantics of Logic Programs
نویسندگان
چکیده
We show that there is a close connection between the construction of the perfect kernel of a Π1 class via the interation of the Cantor-Bendixson derivative through the ordinals and the construction of the well-founded semantics for logic programs via Van Gelder’s alternating fixpoint construction. This connection allows us to transfer known complexity results for the perfect kernel of Π1 classes to to give new complexity results for various questions about the well-founded semantics wfs(P ) of a logic program P .
منابع مشابه
Model-theoretic complexity of automatic structures
We study the complexity of automatic structures via well-established concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and Cantor-Bendixson ranks (of trees). We prove the following results: 1) The ordinal height of any automatic wellfounded partial order is bounded by ω; 2) The ordinal heights of automatic well-founded r...
متن کاملModel Theoretic Complexity of Automatic Structures (Extended Abstract)
We study the complexity of automatic structures via wellestablished concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and CantorBendixson ranks (of trees). We prove the following results: 1) The ordinal height of any automatic well-founded partial order is bounded by ω; 2) The ordinal heights of automatic well-founded re...
متن کاملReconciling Well-Founded Semantics of DL-Programs and Aggregate Programs
Logic programs with aggregates and description logic programs (dl-programs) are two recent extensions to logic programming. In this paper, we study the relationships between these two classes of logic programs, under the well-founded semantics. The main result is that, under a satisfaction-preserving mapping from dl-atoms to aggregates, the well-founded semantics of dl-programs by Eiter et al.,...
متن کاملRelating Defeasible Logic to the Well-Founded Semantics for Normal Logic Programs
The most recent version of defeasible logic (Nute 1997) is related to the well-founded semantics by translating defeasible theories into normal logic programs. A correspondence is shown between the assertions of a defeasible theory and the literals contained in the well-founded model of the translation. The translation scheme is based upon (Antoniou & Maher 2002) but is modified to account for ...
متن کاملThe Well-Founded Semantics of Cyclic Probabilistic Logic Programs: Meaning and Complexity
This paper investigates the properties of cyclic probabilistic normal logic programs, consisting of rules and a set of independent probabilistic facts, under the well-founded semantics. That is, we assume that for each fixed truth assignment for the probabilistic facts, the resulting normal logic program is interpreted through the well-founded semantics. We derive results concerning the complex...
متن کامل